Separation of Open Sets Having an Hyperarithmetical Code and Innnite Behaviours of Recursive Transition Systems
نویسنده
چکیده
We extend to the whole class of hyperarithmetical open sets a result from 8] on the separation property, as deened in 1], of some classes of arithmetical open sets. As we do this, we slightly generalize a result from 11] about the position of arithmetical points. We also restate founda-tional connections between language theoretic separation, test equivalence, as deened in 4] over recursive transition systems, and (co-) analytical sets.
منابع مشابه
Kleene Automata and Recursion Theory
Following the introduction of a theoretical computational model on innnite objects, the !-input Turing machine, we present a new type of innnite automata, the Kleene automata. We show it recognizes exactly the class of arithmetical !-languages. Essentially, it is a propositional automaton for which the transition relation is recursive and the interpretation of atomic formulas associated with ea...
متن کاملAmbiguity of ω-Languages of Turing Machines
An ω-language is a set of infinite words over a finite alphabet X . We consider the class of recursive ω-languages, i.e. the class of ω-languages accepted by Turing machines with a Büchi acceptance condition, which is also the class Σ 1 of (effective) analytic subsets of Xω for some finite alphabet X . We investigate the notion of ambiguity for recursive ωlanguages with regard to acceptance by ...
متن کاملThe Link between Organisational Citizenship Behaviours and Open Innovation: A Case of Isfahan High-tech Sector
In the current challenging world,organizations in order to compete on the world stage, satisfying the needs and expectations of the customers and adapting to the changing nature of jobs, trying tohairthe staff who operates beyond the responsibility and their designated role in the jobs’ Description Because it is believed that operation evaluation are reflected by this behavior and it will inf...
متن کامل